A non-interactive deniable authentication scheme based on designated verifier proofs
نویسندگان
چکیده
منابع مشابه
A non-interactive deniable authentication scheme based on designated verifier proofs
A non-interactive deniable authentication scheme based on designated verifier proofs Bin Wang Information Engineering College of Yangzhou University No.36 Middle JiangYang Road, Yangzhou City, Jiangsu Province, P.R.China Tel: 086-0514-82220820 E-mail:[email protected] Abstract: A deniable authentication protocol enables a receiver to identify the source of the given messages but unable to prov...
متن کاملECC-Based Non-Interactive Deniable Authentication with Designated Verifier
Recently, researchers have proposed many non-interactive deniable authentication (NIDA) protocols. Most of them claim that their protocols possess full deniability. However, after reviewing, we found that they either cannot achieve full deniability, or suffer KCI or SKCI attack; moreover, lack efficiency, because they are mainly based on DLP, factoring problem, or bilinear pairings. Due to this...
متن کاملA Novel Non-interactive Deniable Authentication Protocol with Designated Verifier on elliptic curve cryptosystem
Recently, many non-interactive deniable authentication (NIDA) protocols have been proposed. They are mainly composed of two types, signature-based and shared-secrecy based. After reviewing these schemes, we found that the signature-based approach can not deny the source of the message and thus can not achieve full deniability; and that, the shared-secrecy based approach suffers KCI attack altho...
متن کاملNon-interactive Designated Verifier Proofs and Undeniable Signatures
Non-interactive designated verifier (NIDV) proofs were first introduced by Jakobsson et al. and have widely been used as confirmation and denial proofs for undeniable signature schemes. There appears to be no formal security modelling for NIDV undeniable signatures or for NIDV proofs in general. Indeed, recent work by Wang has shown the original NIDV undeniable signature scheme of Jakobsson et ...
متن کاملEfficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge
We propose a framework for constructing efficient designated-verifier non-interactive zero-knowledge proofs (DVNIZK) for a wide class of algebraic languages over abelian groups, under standard assumptions. The proofs obtained via our framework are proofs of knowledge, enjoy statistical, and unbounded soundness (the soundness holds even when the prover receives arbitrary feedbacks on previous pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2009
ISSN: 0020-0255
DOI: 10.1016/j.ins.2008.11.011